Fuzzy Vehicle Routing Problem with Split Delivery: Trade-off between Air Pollution and Customer Satisfaction
Authors
Abstract:
In large-scale emergency, the vehicle routing problem focuses on finding the best routes for vehicles. The equitable distribution has a vital role in this problem to decrease the number of death and save people's lives. In addition to this, air pollution is a threat to people’s life and it can be considered to omit other kinds of disasters happens because of it. So, a new MINLP model presented is going to face a real situation by considering real world assumptions such as fuzzy demands and travel time, multi depots and items, vehicle capacity and split delivery. The first objective function is to minimize the sum of unsatisfied demand which follows a piecewise function and the second one is to minimize the cost which depends on the fuel consumption. In order to solve the multi-objective problem with fuzzy parameters, nonlinear function has been linearized by convex combination and a new crisp model is presented by defusing fuzzy parameters. Finally, NSGA-П algorithm is applied to solve this problem and the numerical results gained by this procedure demonstrate its convergence and its efficiency in this problem.
similar resources
A green vehicle routing problem with customer satisfaction criteria
This paper develops an MILP model, named Satisfactory-Green Vehicle Routing Problem. It consists of routing a heterogeneous fleet of vehicles in order to serve a set of customers within predefined time windows. In this model in addition to the traditional objective of the VRP, both the pollution and customers’ satisfaction have been taken into account. Meanwhile, the introduced model prepares a...
full textCustomer satisfaction in dynamic vehicle routing problem with time windows
The dynamic vehicle routing and scheduling problem is a well-known complex combinatorial optimization problem that drew significant attention over the past few years. This paper presents a novel algorithm introducing a new strategy to integrate anticipated future visit requests during plan generation, aimed vailable online xxx eywords: enetic algorithms ustomer satisfaction at explicitly improv...
full textTwo phase genetic algorithm for vehicle routing and scheduling problem with cross-docking and time windows considering customer satisfaction
Cross-docking is a new warehousing policy in logistics which is widely used all over the world and attracts many researchers attention to study about in last decade. In the literature, economic aspects has been often studied, while one of the most significant factors for being successful in the competitive global market is improving quality of customer servicing and focusing on customer satisfa...
full textNew Lower Bounds for the Split Delivery Vehicle Routing Problem
This paper presents an algorithm to obtain lower bounds for the Split Delivery Vehicle Routing Problem. An extended formulation over a large set of variables is provided and valid inequalities are identified. The algorithm combines column and cut generation and was able to improve the lower bound for almost all instances tested.
full textA Construction Heuristic for the Split Delivery Vehicle Routing Problem
The Split Delivery Vehicle Routing Problem (SDVRP) is a relaxation of the Capacitated Vehicle Routing Problem (CVRP) where customers may be assigned to multiple routes. A new construction heuristic is developed for the SDVRP and computational results are given for thirty-two data sets from previous literature. With respect to the total travel distance, the construction heuristic compares favora...
full textMy Resources
Journal title
volume 33 issue 2
pages 1- 16
publication date 2022-06
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023